System and Method for Determining Implied Market Information

ABSTRACT

Implied prices and their quantities are computed. Markets are characterized by exhaustively computing one or more combinations of other related markets. Each combination when summed in a particular way results in the market under consideration. In a described embodiment, the number of market combinations found is an exhaustive list of market combinations such that the market under consideration can be fully and completely characterized, such that each combination provides implied market information about the market under consideration. Implied market information can include implied prices and their quantities, which are computed for each combination and used accordingly in displays or used by automated or semi-automated trading tools.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.13/323,324 filed Dec. 12, 2011, which is a continuation of U.S. patentapplication Ser. No. 12/941,992 filed Nov. 8, 2010, now U.S. Pat. No.8,099,355, which is a continuation of U.S. patent application Ser. No.12/464,388 filed May 12, 2009, now U.S. Pat. No. 7,870,063, which is acontinuation of U.S. patent application Ser. No. 11/415,452 filed May 1,2006, now U.S. Pat. No. 7,548,882, which is a continuation of U.S.patent application Ser. No. 10/403,374 filed Mar. 31, 2003, now U.S.Pat. No. 7,765,134, which claims the benefit of U.S. ProvisionalApplication Ser. No. 60/424,179 filed on Nov. 5, 2002, entitled “Systemand Method For Determining Implied Market Information,” the contents ofwhich are fully incorporated herein by reference.

FIELD OF INVENTION

The present invention is directed towards electronic trading. Morespecifically, the present invention is directed towards a system andmethod for determining implied market information.

BACKGROUND

Trading methods have evolved from a manually intensive process to atechnology enabled, electronic platform. With the advent of electronictrading, a user or trader can be in a virtually direct contact with themarket, from practically anywhere in the world, performing nearreal-time transactions, and without the need to make personal contactwith a broker.

Electronic trading is generally based on a host exchange, one or morecomputer networks, and client devices. In general, the host exchangeincludes one or more centralized computers to form the electronic heart.Its operations typically include order matching, maintaining order booksand positions, price information, and managing and updating a databasethat records such information. The host exchange is also equipped withan external interface that maintains uninterrupted contact to the clientdevices and possibly other trading-related systems.

Using client devices, market participants or traders link to the hostexchange through one or more networks. A network is a group of two ormore computers or devices linked together. There are many types of wiredand wireless networks such as local area networks and wide areanetworks. Networks can also be characterized by topology, protocol, andarchitecture. For example, some market participants may link to the hostthrough a direct connection such as a T1 or ISDN. Some participants maylink to the host exchange through direct connections and through othercommon network components such as high-speed servers, routers, andgateways. The Internet, a well-known collection of networks andgateways, can be used to establish a connection between the clientdevice and the host exchange. There are many different types of networksand combinations of network types known in the art that can link tradersto the host exchange.

Regardless of the way in which a connection is established, softwarerunning on the client devices allows market participants to log onto oneor more exchanges and participate in at least one market. A clientdevice is a computer such as a personal computer, laptop computer,hand-held computer, and so forth that has network access. In general,client devices run software that creates specialized interactive tradingscreens. Trading screens enable market participants to obtain marketquotes, monitor positions, and submit orders to the host.

Generally, when an order is submitted to a host exchange, the hostchecks the conditions associated with the order, for example price andquantity, and prioritizes the order with other orders of the same price.When the order conditions are satisfied in the market, a trade occursand trade information is then relayed in some fashion to one or moreclient devices. In fact, the host exchanges typically publish a datafeed to the client devices so that the traders can have access to themost current market information.

Market information commonly includes information related to the insidemarket and market depth. The inside market is the lowest sell price inthe market and the highest buy price in the market at a particular pointin time. Market depth refers to a quantity available at the insidemarket and can refer to quantity available at other prices away from theinside market. The quantity available at a given price level is usuallyprovided by the host exchange in aggregate sums. In other words, a hostexchange usually provides the total buy or the total sell quantityavailable in the market at a particular price level in its data feed.The extent of the market depth available to a trader usually depends onthe host exchange. For instance, some host exchanges provide marketdepth for an infinite number of price levels, while some provide onlyquantities associated with the inside market, and others may provide nomarket depth at all. Additionally, host exchanges can offer other typesof market information such as the last traded price (LTP), the lasttraded quantity (LTQ), and order fill information.

Some traders prefer to trade only one tradable object at a time, andsometimes traders wish to trade more than one tradable object at a timewhich is a strategy often referred to as spreading or strategy trading.When a trader traders one tradable object, a trader might trade the June2002 corn contract, for example. That is, the trader is offering to buyor willing to sell the corn contract, depending on his or her tradingstrategy. Likewise, a trader might trade the December 2003 corncontract. Some traders, however, trade more than one tradable object ata time. For example, a trader might want to spread trade the June 2002corn contract and the December 2003 corn contract, such as buying theJune corn contract and selling the December corn contract, or viceversa. Spreading can also be done based on other relationships besidescalendar months. One such example would be trading a 10-year note and a5-year note. According to these examples given above, the spread has twolegs. Legs refer to the portions of the trades associated with eachindividual tradable object, which is also referred to as an outrightmarket. For example, the June/December corn calendar spread has twolegs, the June corn market makes up a leg and the December corn marketmakes up the other leg.

Spreads or strategies can have more than two legs. For example, awell-known strategy called the butterfly involves buying a near monthcontract, selling two middle month contracts, and buying a far monthcontract. An example might be buying 1 March corn contract, selling 2June corn contracts, and buying 1 December corn contract. The butterflystrategy in this example has three legs. The March corn market makes upone leg, the June corn market makes up a second leg, and the Decembercorn market makes up a third leg. There are many other types ofwell-known strategies, besides the butterfly, having more than two legs.

Whether or not a trader decides to trade one or more tradable objects,it often becomes useful to see as many buy and/or sell orders aspossible for each particular market. For example, when trading in aparticular market, it is useful to see every direct order (e.g., theorder's quantity and price) that is in the market, but it is also usefulto see every order that has been implied into the market. An impliedorder is made up of an implied price and its implied quantity. Impliedprices and quantities are derived from direct orders in a combination ofoutright markets and spreads/strategies. For example, orders in outrightmarkets may imply orders (referred to as an “implied in” orders) into aspread market, and orders in a spread market plus orders in an outrightmarket may imply orders (referred to as an “implied out” orders) intoanother outright market.

The LIFFE CONNECT™ Trading Host provided by a well-known exchange,LIFFE, calculates some implied “in” and implied “out” prices andquantities for its products, and in particular, for simple two-leggedspreads and their legs. The LIFFE CONNECT™ Trading Host may use theimplied prices and their quantities it calculated, in addition to usingdirect prices and quantities, to match incoming orders. The LIFFECONNECT™ Trading Host, however, does not provide information relating tothe implied in prices and quantities to traders, even though itconsiders them when checking for matches. LIFFE does not provide suchinformation because it can use up much needed network bandwidth.Consequently, a trader can end up matching against these “invisible”quantities.

Although the LIFFE CONNECT™ Trading Host provides a better solution thanearlier matching systems since it calculates and uses some of theimplied prices and quantities in its matching algorithm, it still lacksthe sophistication to exhaust every or nearly early opportunity offinding more implied prices and quantities. Further, because the LIFFEsystem does not provide implied data to traders, the traders are notable to take advantage of the implied data being used at the exchange.

With the advent of electronic exchanges, it is becoming more desirableto utilize tools that assist a trader in adapting his or her strategy toan electronic marketplace, and to help the participant make desirabletrades. It is also becoming more desirable to improve matching enginesso that traders can get the best prices for their trades and increaseliquidity. What is needed, then, is a way for determining all (or most)possible prices and quantities in a market, whether they are direct orimplied.

DETAILED DESCRIPTION OF THE DRAWINGS

FIG. 1 is an example of a network configuration for a communicationsystem utilized to access one or more exchanges;

FIG. 2 illustrates inside market information associated with a firsttradable object A that can be used to imply prices and quantities in astrategy market;

FIG. 3 illustrates inside market information associated with a secondtradable object B that can be used imply prices and quantities in thestrategy market;

FIG. 4 illustrates implied-in prices and quantities for the strategymarket based on related markets as used in accordance with one exampleembodiment;

FIG. 5 illustrates implied-out prices and their quantities as used inaccordance with one example embodiment;

FIG. 6 illustrates possible market combinations that imply prices andquantities into one example market, designated as market B;

FIG. 7 is a flow chart that illustrates an example process forrepresenting markets by market combinations using vector notation; and

FIG. 8 illustrates a table of implied prices and their quantities whichwere obtained by using example embodiments described herein.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S) Overview

A system and related methods for computing implied prices and quantitiesare described. The system preferably characterizes a market byexhaustively computing one or more combinations of other related marketssuch that the markets of each combination when summed would result inthe market under consideration. This results in having one or morecombinations or equations that describe the same market in preferably adifferent and independent way. Preferably, the number of marketcombinations found is an exhaustive list of market combinations suchthat the market under consideration can be completely characterized, ifso programmed. Then, each combination can provide implied marketinformation about the market under consideration. Implied marketinformation can include implied prices and their quantities, which arecomputed for each combination and used accordingly to characterize themarket. In the preferred embodiment, the combinations are computed onetime and stored for later use. The already determined combinations orequations can then be used to calculate implied prices and quantities.

Implied prices and their implied quantities are useful at tradingterminals. By having such information that completely characterizes themarket (e.g., direct orders, implied orders, or both direct and impliedorders) made available and/or displayed at the trading terminals, thetrader (or trading-related software applications) can make betterdecisions about a particular trading strategy. This can lead to betterprices and greater liquidity for the trader.

Implied prices and quantities are useful at a host exchange. By havingavailable information that completely characterizes the market (e.g.,direct orders, implied orders, or both direct and implied orders) at thehost exchange, the matching engine can match orders at improved pricesor can add liquidity to certain tradable objects or strategies.

Although using implied prices and quantities can be beneficial at atrading terminal, a matching engine, or some other trading relateddevice, computing the actual implied prices and their quantities can beperformed on any computer or electronic device, which is preferablycoupled to the trading terminal or matching engine through one or morenetworks. Therefore, it should be understood that the presentembodiments including the process of determining implied prices and/ortheir implied quantities can be accomplished on the client device, on acomputer at the electronic exchange, or on any other computer capable ofprocessing information to produce a desired result such as a gateway orserver. If implied prices and their quantities are computed at agateway, for example, they can be published to client devices coupled tothe gateway over one or more networks.

These aspects of the present embodiments and other aspects will becomereadily apparent to one skilled in the art from the followingdescription. Furthermore, there are many advantages to computing impliedprices and/or quantities, too numerous to mention here, but which willalso become apparent to one of ordinary skill in the art with thefollowing description.

Hardware and Software Overview

FIG. 1 is a block diagram that illustrates an electronic trading system100 in accordance with the preferred embodiment in which implied pricesand quantities may be calculated. The system 100 includes at least onehost exchange 102 and one or more client devices 104. Intermediatedevices such as gateways, routers, and other such types of networkdevices may be used to assist the client device 104 and host exchange102 in communicating over network(s) 106. Intermediate devices,additional host exchanges, and additional client devices are not shownin FIG. 1 for sake of clarity. It should be understood, however, thatother types of network configurations known in the art may be used asthe system 100.

A. Host Exchange

The host exchange 102 may include, for example, the London InternationalFinancial Futures and Options Exchange (“LIFFE”), the Chicago Board ofTrade (“CBOT”), the New York Stock Exchange (“NYSE”), the ChicagoMercantile Exchange (“CME”), the Exchange Electronic Trading (“Xetra”)(a German stock exchange), or the European Exchange (“Eurex”). The hostexchange 102 might also refer to other systems, from basic to morecomplex systems, which automatically match incoming orders. Theseexample host exchanges and other host exchanges are well known in theart. Communication protocols required for connectivity to one of thesehost exchanges are also well known in the art.

As described in the background, a host exchange can implement numeroustypes of order execution algorithms. The present invention can work withany particular order execution algorithm, and therefore the presentinvention should not be limited to any type of order executionalgorithm. However, for sake of illustration, some example orderexecution algorithms include first-in-first-out and pro rata algorithms.The first-in-first-out (FIFO) algorithm, used by Eurex for example,gives priority to the first person to place an order. Another algorithm,the pro rata algorithm, for example, takes into account each book orderat the inside market price according to its percentage of the overallvolume bid or offer at that price level, regardless of its time stamp,thus, avoiding an imbalance in priority between orders with small andlarge quantities.

Regardless of the type of order execution algorithm used, each hostexchange including the host exchange 102 preferably provides similartypes of information to the subscribing client devices 104. Theinformation that the host exchange 102 provides is referred tohereinafter as market information. Market information may include datathat represents just the inside market, where the inside market is thelowest sell price (best offer or best ask) and the highest buy price(best bid) at a particular point in time. The market information 108 mayalso include market depth. Market information can contain other types ofmarket information such as the last traded price (LTP), the last tradedquantity (LTQ), and/or order fill information. The contents of marketinformation are generally up to the host exchange 102.

As previously described, the preferred embodiment may be used to tradeany tradable object. As used herein, the term “tradable object,” referssimply to anything that can be traded with a quantity and/or price. Itincludes, but is not limited to, all types of tradable objects such asfinancial products, which can include, for example, stocks, options,bonds, futures, currency, and warrants, as well as funds, derivativesand collections of the foregoing, and all types of commodities, such asgrains, energy, and metals. The tradable object may be “real”, such asproducts that are listed by an exchange for trading, or “synthetic”,such as a combination of real products that is created by the user. Atradable object could actually be a combination of other tradableobject, such as a class of tradable objects.

B. Client Device

In the preferred embodiment, the client device 104 is a computer thatprovides an interface to trade at the host exchange 102. An exampleclient device is a personal computer, laptop computer, hand-heldcomputer, and so forth. The client device 104, according to thepreferred embodiment, includes at least a processor and memory. Theprocessor and memory, which are both well-known computer components, arenot shown in the figure for sake of clarity. Memory may include computerreadable medium. The term computer readable medium, as used herein,refers to any medium that participates in providing instructions toprocessor for execution. Such a medium may take many forms, includingbut not limited to, non-volatile media, volatile media, and transmissionmedia. Non-volatile media includes, for example, optical or magneticdisks, such as a storage device. Volatile media may include dynamicmemory, such as main memory or RAM (random access memory). Common formsof computer-readable media include, for example, a floppy disk, aflexible disk, a hard disk, a magnetic tape, or any other magneticmedium, a CD-ROM, any other optical medium, punch cards, paper tape, anyother physical medium with patterns of holes, a RAM, a PROM, and EPROM,a FLASH-EPROM, and any other memory chip or cartridge, or any othermedium from which a computer can read.

In the preferred embodiment, the client device 104 receives marketinformation 108 from the host exchange 102. The market information isreceived over the network(s) 106. The network(s) 106 may include a groupof computers and/or associated devices that are connected bycommunications facilities, and can involve permanent connections, suchas cables, or temporary connections made through telephone or othercommunication links. The network(s) 106 can be as small as a LAN (localarea network) consisting of a few computers, printers, and otherdevices, or it can consist of many small and large computers distributedover a vast geographic area (WAN or wide area network), or it canconsist of both types of networks (both LAN and WAN).

According to the preferred embodiment, market information is displayedto the trader on the client device 104. Preferably, the marketinformation, or a portion thereof, is arranged using techniquesdescribed herein and is displayed on the visual output device or displaydevice of the client device 104. The output device can be any type ofdisplay. For example, the display could be a CRT-based video display, anLCD-based or a gas plasma-based flat-panel display, or some other typeof display. The present invention is not limited to any type of display.

Upon viewing market information or a portion thereof, a trader may wishto send transaction information to the host exchange 102. To do so, thetrader may input the transaction information into the client device bytyping into a keyboard, through a mouse, or some other input device.Preferably, transaction information includes an order to buy or an orderto sell a tradable object. An order generally has two parameters, priceand quantity, but the present invention is not limited to a particularnumber of parameters that may be used to characterize the order.According to another embodiment, transaction information might alsorefer to other order related transactions such as delete order messages,cancel and replace messages, and so forth. There are many differenttypes of messages and order types that can be submitted to the hostexchange 102, all of which are considered various types of transactioninformation. Then, transaction information is sent from the clientdevice 104 to the host exchange 102 over the network(s) 106.

As previously described, FIG. 1 provides an example system overviewaccording to one embodiment. Various changes and/or modifications may bemade to the system and still fall within the scope of the presentinvention. For example, it should be understood that the presentinvention is not limited to any particular network architecture orconfiguration such as described in FIG. 1. The present invention may beapplied with utility on any electronic device in any network that can beused for electronic trading. Further, as mentioned in reference to thepreceding paragraphs any network entity such as the client device 104,the host exchange 100, the gateway 102, or any other network entity incommunication with one of the devices may calculate implied quantitiesand prices according to methods described below.

Implied in Example

According to one embodiment, implied quantities and implied prices maybe calculated from information associated with direct orders in acombination of outright markets that imply orders into a spread market,also commonly referred to as “implied in” orders. For example, usingthree tradable objects A, B, and C, the tradable objects can implyorders into three spread markets. Specifically, a tradable object AB maybe a first spread strategy having the tradable object A as a first legand the tradable object B as a second leg. A tradable object AC may be asecond spread strategy having the tradable object A as a first leg, andthe tradable object C as a second leg. Finally, a tradable object BC maybe a third spread strategy having the tradable object B as a first leg,and the tradable object C as a second leg.

When an exchange provides a spread, the exchange may provide arelationship between two or more tradable objects that form the spread.For example, the following relationships may be used for the spreadsdescribed above:

Spread AB=Leg A−Leg B  EQN (1)

Spread AC=Leg A−Leg C  EQN (2)

Spread BC=Leg B−Leg C  EQN (3)

Further, each equation above may be used to generate two separateequations, one for buying and one for selling a spread. For example,using the first spread equation, the following buy and sell definitionsmay be derived:

Buy AB=Buy A−Sell B  EQN (4)

Sell AB=Sell A−Buy B  EQN (5)

The relationships in EQNs. (4) and (5) may then be used to calculate bid(buy) and ask (sell) implied quantities and prices. FIG. 2 is agraphical interface displaying inside market information associated witha first tradable object A being traded on a first exchange. The insidemarket represents the highest buy price and the lowest sell price. Asshown, there is a bid quantity of 3 at a price of 100, and there is anask quantity of 7 at a price of 110. In FIG. 2, we can assume that thebid and ask orders are direct, meaning that the orders were placeddirectly on the market associated with the first tradable object.

FIG. 3 is a graphical interface displaying inside market informationassociated with a second tradable object B. As shown there is a bidquantity of 5 at a price of 110, and there is an ask quantity of 1 at aprice of 115. Also, similarly to FIG. 2, we can assume that ordersassociated with the tradable object B were directly placed into market.The orders associated with the tradable object A and tradable object Bcan imply orders into a spread tradable object AB. FIG. 4 illustratesimplied prices and implied quantities for a spread AB having thetradable object A as a first leg and the tradable object B as a secondleg. The implied prices for the spread AB can be calculated using EQNs.(4) and (5) above. As shown, there is an implied bid quantity of 1 at aprice of −15, and an implied ask quantity of 5 at a price of 0.

It should be understood that if quantities at price levels other thanthe inside market are available, implied prices and implied quantitiesfor the spread AB may be calculated for quantities at those price levelsas well. Using EQN. (4), the price to buy the spread AB may be found:100−115, which is −15. In this example, the quantity at the price −15 isthe minimum of the quantities 3 and 1, which is 1. It should beunderstood that the minimum of the quantities is used because once aquantity associated with the second leg is used up, there is no quantityleft to match the quantity of 2 remaining in the first leg. Similarly,using EQN (5), a price to sell the spread AB is found: 110−110=0. Inthis example, the implied ask quantity is 5 based on the minimum of thetwo quantities 7 and 5 associated with the two legs of the spread AB.Referring to FIG. 4, the computed implied quantities and prices areshown for the spread AB.

According to the preferred embodiments, tradable objects are expressedin a vector notation. To do this, it is preferable to express a marketassociated with each tradable object as an identity vector, such thatthe tradable object A=(1,0,0), tradable object B=(0,1,0), and spread oftradable objects AB=(0,0,1). In the illustrated embodiment, each vectoris of the same size, where the size of the vector corresponds to thenumber of tradable objects in the set. In this example, there are threetradable objects so that each vector has three dimensions. Also,strategy markets with two or more legs can be also expressed as adefinition vector. For example, buying spread AB can be also defined as(1,−1,0), which means buying a tradable object A and selling a tradableobject B. In such an embodiment, selling the spread AB can be defined as(−1,1,0), which means selling the tradable object A and buying thetradable object B.

Implied Out Example

An implied out occurs when there are orders in one or more outrightmarkets and in a strategy market, e.g., a spread market, such that thesemarkets imply out prices and quantities to another outright market. EQN(1) has been rearranged to get: B=A−AB. Then, the followingrelationships are determined:

Buy B=Buy A−Sell AB  EQN (6)

Sell B=Sell A−Buy AB  EQN (7)

Using EQN (6) and EQN (7), prices and their quantities from AB and A canbe implied into market B. Referring to the example described inreference to FIG. 2, there is a bid quantity of 2 left at a price of 100(because the bid quantity of 1 was used to imply the bid quantity intothe AB spread in FIG. 4), and there is an ask quantity of 2 left at aprice of 110 (because the sell quantity of 5 was used to imply the askquantity into the AB spread). Based on the remaining quantities for thetradable object A (2 @ 100, and 2 @ 110), and the quantities in theoutright market associated with the spread AB, the implied bid quantityin the market of the tradeable object is 2 at a price level of 100.Using EQN (6), a price of the bid quantity of the tradable object isfound: 100−0=100, and the quantity is the minimum of the quantities 2and 5. Using EQN (7), a price of the ask quantity of the tradable objectis found: 110−(−15)=125, and the quantity is the minimum of thequantities 2 and 1. FIG. 5 illustrates implied out quantities for thetradable object B. As shown in FIG. 5, there is an implied bid quantityof 2 at a price of 100, and an implied ask quantity of 1 at a price of125.

Further, it should be understood that instead of using implied in pricesand quantities of the market associated with the spread AB, theequations for the implied out market associated with the tradable objectB may be rearranged so that direct prices and quantities are usedinstead of the implied ones. For example, EQN (5) (Sell AB=Sell A−Buy B)may be substituted into EQN (6), so that EQN (6) becomes:

Buy B=Buy A−Sell A+Buy B  EQN (8)

It should be understood that the Buy B on the right hand side of EQN (8)corresponds to the direct market, and the Buy B on the left hand side ofEQN (8) corresponds to the implied out price.

Using direct prices of the tradable objects A and B illustrated in FIGS.2 and 3, the implied out price for the buy quantity is 100 (as in FIG.5). Similarly, EQN (4) (Buy AB=Buy A−Sell B) may be substituted into EQN(7), so that EQN (7) becomes:

Sell B=Sell A−Buy A+Sell B  EQN (9)

As in EQN (8), the Sell B on the right hand side of the EQN (9)corresponds to the direct market, and the Sell B on the left hand sideof EQN (9) corresponds to the implied out market.

Using direct prices for the tradable objects A and B, the implied outprice for the sell quantity is 125 (as shown in FIG. 5). However, itshould be understood that orders could also be directly placed in themarket associated with the spread AB.

EQN (1) can also be rearranged to get: A=AB+B. Then, the followingrelationship can be determined:

Buy A=Buy AB+Buy B  EQN (10)

Sell A=Sell AB+Sell B  EQN (11)

EQN (10) and EQN (11) can then be used to determine implied prices andquantities for the tradable object using the markets associated with thetradable objects B and AB. However, since there is no quantity left forthe tradable object B (the quantity was used up to imply quantity intothe spread AB), there are no implied out quantities for the tradableobject A. Different orders of equations that are used to calculateimplied prices and quantities may yield different results in impliedquantities. To solve for an optimal solution, as will be explainedfurther below, the equations may be represented as a linear programmingproblem and may be solved using a linear method such as Simplex, forexample.

Multiple Implied Prices and Maximum Implied Quantity

It should be understood that multiple implied prices may be calculatedfor the same tradable object based on different market combinationsassociated with tradable objects. For example, EQN (1) can be rearrangedto get:

A=AB+B  EQN (12)

Then, EQN (3) can be rearranged to get B=BC+C, which, when substitutedto EQN (12), gives:

A=C+AB+BC  EQN (13)

Further, EQN (2) can be rearranged to get C=A−AC, which, whensubstituted to EQN (13), gives:

A=B+AB−AC+BC  EQN (14)

Then, as explained earlier, each of EQNs (12), (13), and (14), can beused to determine implied bid and asks prices and quantities for thetradable object A. The following relationships can be determined forimplied bid prices:

Buy A=Buy AB+Buy B  EQN (15)

Buy A=Buy C+Buy AB+Buy BC  EQN (16)

Buy A=Buy B+Buy AB−Sell AC+Buy BC  EQN (17)

Let's assume that the bid quantities at inside markets for the tradableobjects B, C, AB, and BC are 1 @ 90, 1 @ 80, 1 @ 10, and 1 @ 10. Then,let's assume that the ask quantity at the inside market for the tradableobject AC is 1 @ 5. Using EQN. (15), there is an implied bid quantity of1 at an implied price level of 100. Then, using EQN. (16), there is animplied bid quantity of 1 at an implied price level of 100, and usingEQN. (17), there is an implied bid quantity of 1 at an implied pricelevel of 105. Then, the best implied price, e.g., 105, in this examplefor the bid, may be selected as an implied price for the tradable objectA.

However, if the bid quantity at the inside market for the tradableobject AB were 1 @ 85, then using EQNs. (15), (16), and (17), theimplied quantities at prices would be 1 @ 100, 1 @ 105, and 1 @ 105,respectively, which would imply the quantity of 2 rather than 1 at thebest bid price of 105. When two or more equations provide the sameimplied price, the maximum or optimal implied quantity may be calculatedto provide a user accurate quantity information at the calculatedimplied price level. Using the example above, when a trader buys onecontract of the spread AB, the quantity in the bid quantity of thespread AB in EQN (15) and EQN (16) goes to 0, so that presenting thequantity of 2 for the implied best bid price of 105 would be inaccurate.

According to one method, the equations that are used to determine thebid/ask implied prices could also be used to determine the maximumimplied quantity for each implied price. However, the order in which theequations are used may produce different results, and the quantitiesdetermined using such a method may be spread between a range of manyquantities. Thus, such a method makes it difficult to select thequantity value that best represents the implied quantity for the impliedprice level. To avoid these problems and provide a trader with anoptimal estimation of the available quantity at the implied price level,a linear optimization method may be used to determine a maximumquantity, the embodiment of which will be described hereinafter. Itshould be understood, and as mentioned in earlier paragraphs, that theoptimization method may be used when two or more equations result in thesame implied price or when the equation, when used in different orders,produce different implied quantities, for example. However, impliedprices and quantities may be calculated using the optimization method inother scenarios as well.

According to one embodiment, a linear programming problem based on aformula or a linear function, often called an objective function, with anumber of linear constraints, may be defined to determine the maximum oroptimal implied quantity. The linear programming problem may then besolved using any linear program such as a simplex method or any otherlinear program. The simplex method is an algorithm (or a set ofinstructions) that determines a maximum value of a linear expression byexamining corner points of one or more equations of the linear problemin an ordered manner until the highest or optimal value is found.However, it should be understood that any other method for determiningthe optimal implied quantity could also be used.

As explained in the preceding paragraphs, linear programming may beapplied to a set of equations representing quantities that are availablebased on each equation that is used to calculate the implied prices. Forexample, the following equation, EQN. (18), may be used to determine amaximum quantity for the implied price, where each s_(i) corresponds toan implied quantity determined based on each equation “i.”

$\begin{matrix}{{Max}\; {\sum\limits_{i}^{I}s_{i}}} & {{EQN}\mspace{14mu} (18)}\end{matrix}$

Further, EQN. (15) may be subject to one or more constraints such as theone illustrated with the following formula:

$\begin{matrix}{{s \propto {\sum\limits_{i = 1}^{I}{q_{im}*s_{i}}} \leq {q_{m}\mspace{14mu} {\forall m}}} = {1\mspace{14mu} \ldots \mspace{14mu} m}} & {{EQN}\mspace{14mu} (19)}\end{matrix}$

In the formula illustrated in EQN (19), the summation goes across allequations starting with the first equation i=1 that is used to implyprices and quantities, until the last equation “I” is reached. Further,in the illustrated formula, “q_(im)” corresponds to the absolute valueof a coefficient corresponding to “m^(th)” tradable object (or market)in the i^(th) equation so that for example, in the equation A=B+2AB,q_(oi)=1, and q₀₃=2, where markets corresponding to tradable objects A,B, C, AB, AC, and BC, map to subscripts 0, 1, 2, 3, 4, and 5,respectively.

Referring back to EQNs. (12), (13), and (14), and considering buys andsells associated with each equation as a separate market, the followingformulas developed based on EQN. (19) may be generated for 12 markets(0-11), or for buys and sells corresponding to each of 6 tradableobjects (A, B, C, AB, AC, and BC):

M0 0*s ₁+0*s ₂+0*s ₃≦1  EQN (20)

M1 0*s ₁+0*s ₂+0*s ₃≦1  EQN (21)

M2 1*s ₁+0*s ₂+1*s ₃≦1  EQN (22)

M3 0*s ₁+0*s ₂+0*s ₃≦1  EQN (23)

M4 0*s ₁+1*s ₂+0*s ₃≦1  EQN (24)

M5 0*s ₁+0*s ₂+0*s ₃≦1  EQN (25)

M6 1*s ₁+1*s ₂+1*s ₃≦1  EQN (26)

M7 0*s ₁+0*s ₂+0*s ₃≦1  EQN (27)

M8 0*s ₁+0*s ₂+0*s ₃≦1  EQN (28)

M9 0*s ₁+0*s ₂+1*s ₃≦1  EQN (29)

M10 0*s ₁+1*s ₂+1*s ₃≦1  EQN (30)

M11 0*s ₁+0*s ₂+0*s ₃≦1  EQN (31)

For example, EQN. (20) corresponds to the buy of the tradable object A.Since A is not a variable in any of the EQNs. (12)-(14), thecoefficients “q” for each of s₁-s₃ are zeroes. EQN. (21) corresponds tothe ask equation for the tradable object A; however, since there is no Ain any of the EQNs. (12)-(14), the coefficients once again are zeroes.Referring now to the buy equation associated with the B tradable object(M2) in EQN. (22), the “q” coefficients for s₁ and s₃ are “1” since B ispart of EQN. (12) and EQN. (14) corresponding to s₁ and s₃,respectively. Referring now to EQN. (29) for the ask market associatedwith the tradable object AC, the “q” coefficient associated with s₃ isan absolute value of the negative coefficient (where negative indicatesthe ask activity) in EQN. (14). Coefficients in other equations aredetermined in the same manner. Further, q_(m) for each of the EQNs.(20)-(31) is 1, because q_(m) corresponds to a direct quantity that isavailable for market m.

EQNs. (20)-(31) may then be solved using a linear algorithm, such as asimplex algorithm, to determine the maximum s_(i) implied quantity. Itshould be understood, however, than a different or equivalent linearoptimization method may be used to solve the equations for the maximumimplied quantity.

Multiple Combinations of Markets

The above examples (implied in and implied out) illustrated in FIGS.2-5, involved two markets including two outright markets and a spreadbetween them. When an exchange has multiple related markets, some ofwhich are outright markets and some of which are spreads, the number ofcombinations increases. FIG. 6 illustrates one example market,designated as market B that has multiple combinations, which can implyprices into it. As shown in FIG. 6, the markets include market AB,market A, market B, market ABC, market CB, and market C. Market AB is aspread between markets A and B. Market ABC is a spread between marketsA, B, and C. Market CB is a spread between markets C and B. This exampleshows that prices and quantities can be implied into the outright marketB from the circled combinations of markets. For example, one combinationis market AB and market A that when summed in a particular way willresult in a market B. Another combination is market CB and market C thatwhen summed will result in a market B. A third combination is marketABC, market A, and market C that when summed will result in a market B.As a result, in this example there are, at least, four marketpossibilities for market B. Each of the four market possibilities shownmay provide similar implied market information, but it is also possiblethat each of the market possibilities provide different implied marketinformation as explained above. For purposes of illustration only, theexample shown in FIG. 6 uses a set of six markets and shows only fourmarket combinations for market B. However, there are many other possiblecombinations for market B that were not shown for sake of clarity inthis example, but are shown in later examples.

Representing Markets in Vector Notation

According to the preferred embodiment, to determine many possiblecombinations that a market may have, it becomes more efficient torepresent the markets using a vector notation. Then, using varioustechniques, such as generating equations by solving and substitutingthat will be described below, the combinations of markets can bedetermined, and from those combinations implied prices and their impliedquantities can be determined. Vector notation allows a computer toswiftly calculate combinations and implied prices/quantities. Thiscomputer processing efficiency is especially advantageous if impliedprices and their quantities are computed after every marketprice/quantity update occurs.

FIG. 7 is a flow chart that illustrates an example process forrepresenting all (or nearly all, depending on when the process is ended)combinations that equate to every market in a set of markets as vectors.For sake of illustration, the process is described with respect to anexample; however, it should be understood that the process is notlimited to any particular example used herein. Assume that six relatedmarkets include a July contract (L1), September contract (L2), and aDecember contract (L3), and the spreads include a July/September spread(S1), a September/December spread (S2), and a July/December spread (S3).The set of markets includes market L1, market L2, market L3, market S1,market S2, and market S3. The set of markets generally consists ofrelated markets and can be chosen manually or automatically. However,any number of related markets can be used. As previously mentioned, thevarious markets do not have to be hosted at the same exchange, but themarkets could be hosted at a plurality of different exchanges.

In step 702, a total number of markets is determined. In this example,there is a total of six markets. Preferably, the size of the vectorswill be equal to the total number of markets. For example, a vector usedin this example might be of the dimension six or equivalently the vectormight be represented in the following form: (0,0,0,0,0,0). However, itshould be understood that the number of markets can be higher or lower,as will be described further below.

In the preferred embodiment, the number of markets in a set of marketsis based on information provided by the exchange. For example, anexchange provides the system with information on L1, L2, and L3 in itsdata feed. Some time later, however, a new market, S1, might emerge thathas legs L1 and L2. Preferably, the exchange provides the system withinformation that the new market S1 is now available to trade. Then, thesystem (or exchange) can relate markets L1, L2, and S1 together andfollow the procedure described herein to calculate implied prices andtheir quantities. This process of detecting new markets and relatingthem to other markets preferably occurs throughout the process ofcalculating implieds, because markets can come and go throughout thetrading day. Sometimes, markets are no longer available. Therefore, itis preferable to detect which markets are no longer available to tradeand remove them from the set of markets, which are under consideration.If this occurs, the combinations or equations that have variablesrepresenting the market(s) that no longer exist can be removed from theset of equations; the embodiment of which is described further below.

In step 704, preferably each market is expressed as an identity vector.Buying in a market is positive and selling in a market is negative.Quantities are coefficients of the vector. According to the ongoingexample, the markets can be characterized as a set of first vectors:Market L1=(1,0,0,0,0,0), market L2=(0,1,0,0,0,0), and marketL3=(0,0,1,0,0,0), market S1=(0,0,0,1,0,0), market S2=(0,0,0,0,1,0), andmarket S3=(0,0,0,0,0,1).

In step 706, preferably each strategy is expressed as a definition ofthe outright markets (e.g., L1, L2, and L3) to form a set of secondvectors. This can be performed using EQN (1) or some form thereof. Forthe example, S1=L1−L2=(1,−1,0,0,0,0), S2=L2−L3=(0,1,−1,0,0,0), andS3=L1−L3=(1,0,−1,0,0,0).

In step 708, all other vector combinations are generated. According tothe preferred embodiment, all other vector combinations are computed bysolving for vector combinations to generate a set of third vectors (suchas L1=S1−L2), and then substituting various third vector combinationsinto second vectors (such as substituting L1=S1−L2 into L1 associatedwith S3=L1−L3) to generate even more combinations. The process ofsolving and substituting is described below, and an example is providedusing the six related markets L1, L2, L3, S1, S2, and S3 to furtherillustrate the process of solving and substituting. As a generaloverview of the preferred embodiment, when an equation is found, it issubstituted into all of the equations that have already been accepted.So, for example, imagine a growing group of accepted equations (e.g.,identity vectors, definitional vectors, etc.) and when a new equation isfound, it is substituted into the already accepted equations to formmore equations, some of which are accepted and some of which arerejected. The equations that are accepted are added to this growinggroup of accepted equations. Preferably, this process continues untilpreferably most, if not all, of the combinations are found. This processis described more below.

Solving for Vectors

Solving for vectors includes rearranging definition vectors so thatdesignated variables (markets) are isolated. For example, in the aboveexample, the definition vectors included: S1=L1−L2, S2=L1−L3, andS3=L2−L3. Those definition vectors can be rearranged to solve for L1,L2, and L3. Looking first to S1, the following relationships can befound:

L1=S1+L2  EQN (32)

L2=L1−S1  EQN (33)

Looking next to S2, the following relationships can be found:

L1=S2+L3  EQN (34)

L3=L1−S2  EQN (35)

Looking next to S3, the following relationships can be found:

L2=S3+L3  EQN (36)

L3=L2−S3  EQN (37)

In a preferred embodiment, to find the above relationships using vectornotation, the identity vector for each strategy is set equal to thedefinition vector for each strategy and then the relationships given byEQN (32) through EQN (37) are solved. For example,

S1=L1−L2

(0,0,0,1,0,0)=(1,−1,0,0,0,0). To solve for EQN (32), for example:

L1=S1+L2

(0,1,0,1,0,0)=(0,0,0,1,0,0)+−1(0,−1,0,0,0,0)  EQN (38)

L1=(0,1,0,1,0,0)=(0,0,0,1,0,0)+(0,1,0,0,0,0)  EQN (39)

On paper it might look simple to calculate L1 in terms of S1 and S2 asshown in EQN (38), however this is not necessarily true for a computer.Thus, according to the preferred embodiment, to solve for L1 insequential steps, the first number of the definition vector is zeroedout because it corresponds to L1, which is being solved for. The zeroedout L1 is shown by looking first to the vector (1,−1,0,0,0,0) in whichafter the L1 is zeroed becomes the vector (0,−1,0,0,0,0), which is foundin EQN (38). If the number which is being zeroed out is a positivevalue, then the vector is multiplied by a negative value (negated). Ifthe number which is being zeroed out is a negative value, then the signof the vector remains the same. Because the first number of thedefinition vector in this example is a positive value, the definitionvector is multiplied by a negative one value (or negated). As a resultof negating the definition vector by −1*(0,−1,0,0,0,0), EQN (39) isdetermined, in which L1 is computed by summing the identity vectors forboth S1 and L2. This is done for L2 also, illustrated in the followingequations. For example, S1=L1−L2

(0,0,0,1,0,0)=(1,−1,0,0,0,0). To solve for EQN (33), for example:

L2=L1−S1

(1,0,0,−1,0,0)=(1,0,0,0,0,0)−(0,0,0,1,0,0)  EQN (40)

L2=(1,0,0,−1,0,0)=(1,0,0,0,0,0)+(0,0,0,−1,0,0)  EQN (41)

EQN (34) through EQN (37) can be solved for in the same fashion to get:

L1=S3+L3=(0,0,1,0,0,1)=(0,0,0,0,0,1)+(0,0,1,0,0,0)  EQN (42)

L3=L1−S3=(1,0,0,0,0,−1)=(1,0,0,0,0,0)+(0,0,0,0,0,−1)  EQN (43)

L2=S2+L3=(0,0,1,0,1,0)=(0,0,0,0,1,0)+(0,0,1,0,0,0)  EQN (44)

L3=L2−S2=(0,1,0,−1,0,0)=(0,1,0,0,0,0)+(0,0,0,0,−1,0)  EQN (45)

As the equations are determined, they may be grouped. For instance, sofar, the following accepted combinations or equations shown in vectornotation have been found:

L1 = (1, 0, 0, 0, 0, 0) L2 = (0, 1, 0, 0, 0, 0) L3 = (0, 0, 1, 0, 0, 0)L1 = (0, 1, 0, 1, 0, 0) L2 = (1, 0, 0, −1, 0, 0) L3 = (0, 1, 0, −1, 0,0) L1 = (0, 0, 1, 0, 0, 1) L2 = (0, 0, 1, 0, 1, 0) L3 = (1, 0, 0, 0, 0,−1) S1 = (0, 0, 0, 1, 0, 0) S2 = (0, 0, 0, 0, 1, 0) S3 = (0, 0, 0, 0,0, 1) S1 = (1, −1, 0, 0, 0, 0) S2 = (0, 1, −1, 0, 0, 0) S3 = (1, 0, −1,0, 0, 0)

According to an embodiment, the step of generating all other vectors fora market may be stopped at this point, or any other point before thisphase, for that matter. The time at which the step of generating othervectors is stopped can depend on how many combinations the system isprogrammed to find (or the number of iterations the system is programmedto perform). For example, sometimes a few computed implied prices andtheir quantities (few generations of implieds) are enough to satisfy atrader and his or her trading strategy. However, more combinations canbe found by substitution, an example process of which is describedbelow.

Vector Substitution

Substitution includes substituting those equations that were determinedfrom the solving process into other equations such as the identityvectors, definitional vectors, and so on. This process may continueindefinitely resulting in equations that are dependent and independentfrom each other, but the process can be stopped at some point in time.The point at which the process is stopped, according to one embodiment,is described below. Preferably, the independent equations are used todetermine implied prices and their quantities, while the dependentequations are rejected as it generally means that the same equation, inat least its basic form, already exists.

Using the equations solved in the above example, the process ofsubstitution can be demonstrated. For example, EQN (32) can besubstituted into the definitional vector: S1=L1−L2, which would give:S1=(L2+S1)−L2=S1. This, however results in a dependent equation becauseEQN (8) was derived from the definitional vector. If EQN (34) issubstituted into the same definitional vector, then S1=L1−L2 results in:S1=(L3+S2)−L2=L3+S2−L2. This results in an independent equation andtherefore can be used as a combination. The equation can also be writtenin a vector notation as S1=(0,−1,1,0,1,0). This equation alsoillustrates the concept of implied on implied. That is, EQN (34) givesan implied price and its implied quantity. By substituting EQN (10) intoS1, the resulting equation, S1=(L3+S2)−L2=L3+S2−L2, gives an impliedprice and an implied quantity based in part at least on another impliedprice and implied quantity.

The process of substitution can be repeated until the process is stoppedor until no new (or independent) vectors are generated. Equations fromthe process of substitution can be first generation implied equations(e.g., definitional vectors can be considered first generation impliedequations), or they can be of second generation implied equations (suchas shown in the example above), or they can be of multiple-generationimplied equations such that the equation is based on equations whichhave to be implied from other implied equations. The system preferablycharacterizes each market (e.g., L1, L2, L3, S1, S2, and S3) byexhaustively computing one or more of the equations or combinations ofother related markets such that the markets of each combination whensummed would result in the market under consideration.

Using computer generated results, the following combinations have beenfound.

They can be expressed in the following notation or in vector notation.

L1=L2+S1 S1=L1−L3−S3

L1=L2+S2−S3 S1=−L2+L3+S2

L1=L3+S1+S3 S1=S2−S3

L1=L3+S2

L2=L1−S1 S2=L1−L2+S3

L2=L1=S2+S3 S2=L2−L3+S1

L2=L3−S1+S2 S2=S1+S3

L2=L3+S3

L3=L1−S1−S3 S3=−L1+L2+S2

L3=L1=S2 S3=L1−L3−S1

L3=L2+S1−S2 S3=−S1+S2

L3=L2−S3

A computer generated list of combinations, including those combinationsfound above, are shown in Appendix A. The list provides a read-out ofresults obtained from executing software according to an embodimentusing the six related markets above, but it should be understood thatthe present invention is not be limited to the example. For example, thepresent embodiment should not be limited to the number and/or type ofmarkets used in the example (e.g., more or fewer markets be used,different types of markets can be used), it should not be limited to thenumber of iterations performed to obtain the readout (e.g., more orfewer iterations can be performed), it should not be limited to theorder of equations found (e.g., solving and substitution orders do nothave to occur in the order shown), it should not be limited todetermining if the candidate is accepted or rejected after eachiteration (e.g., as shown in the read-out), and so on.

Once the combinations or equations are determined, they can be storedfor future use to compute implied prices and their quantities. Forexample, they may be stored on a medium. Such a medium may take manyforms, including but not limited to, non-volatile media, volatile media,and transmission media. Non-volatile media includes, for example,optical or magnetic disks, such as storage device. Volatile mediaincludes dynamic memory, such as main memory or RAM (random accessmemory). Common forms of computer-readable media include, for example, afloppy disk, a flexible disk, hard disk, magnetic tape, or any othermagnetic medium, a CD-ROM, any other optical medium, punch cards, papertape, any other physical medium with patterns of holes, a RAM, a PROM,and EPROM, a FLASH-EPROM, and any other memory chip or cartridge, or anyother medium from which a computer can read.

Determining when a Vector is New

As mentioned above, the process of generating combinations or equationsis preferably repeated until there are no more new combinations orequations. According to the preferred embodiment, the time at which theprocess is stopped is based on when there are no new equations beinggenerated, however, this is described in another section below.Regardless of when the process is stopped, it is preferable that when acombination or equation is generated, it is checked against allpreviously accepted equations to determine if it is new or not. If it isa new equation, it is accepted and added to the list of acceptedcombinations, which are later used in calculating implied prices andtheir quantities. If it is not a new equation, it is rejected. In thepreferred embodiment, there are at least two instances that the systemlooks for in determining whether the equation is new or not. In thefirst instance, if the first equation was found: A=B+C, and some timelater the same equation, or a multiple, was found again (e.g., A=B+C,2A=2B+2C, 3A=3B+3C, etc.) then the later equation (s) is rejectedbecause it is not new in light of the first equation. In the secondinstance, assume that a first equation was found: A=B+C, and some timelater another equation was found: A=B+C+D. The later equation isrejected, because the later equation “contains” (e.g., the firstequation (A=B+C) is contained in the later equation (A=B+C)+D) so thatthe later equation must be thrown out as D is equal to 0 and/or thelater equation cannot give a better price than the first equation, forexample. Other techniques for determining whether an equation is new(e.g., independent from previously generated equations) or not (e.g.,dependent from previously generated equations) could be used as well.

Stopping the Process of Determining Combinations

As seen directly above, to determine whether an equation is new or not,the most recent equation determined is compared in a manner to all ofthe previously accepted equations. If the most recent equation is arepeat of an already existing equation, it is rejected. In the preferredembodiment, the process is stopped when equations are simply repeatingthemselves or it is determined that equations are no longer independentfrom each other.

Determining Implied Prices and Quantities

Once a set of vectors (e.g., including combinations or equations) isfound, implied prices can be determined from them. For example, usingthe generated strategies shown in Appendix A and shown below, impliedprices can be calculated for each combination.

L1 = L2 + S1 L2 = L1 − S1 L3 = L1 − S1 − S3 L1 = L2 + S2 − S3 L2 = L1 −S2 + S3 L3 = L1 − S2 L1 = L3 + S1 + S3 L2 = L3 − S1 + S2 L3 = L2 + S1 −S2 L1 = L3 + S2 L2 = L3 + S3 L3 = L2 − S3 S1 = L1 − L2 S2 = L1 − L3 S3 =L2 − L3 S1 = L1 − L3 − S3 S2 = L1 − L2 + S3 S3 = −L1 + L2 + S2 S1 =−L2 + L3 + S2 S2 = L2 − L3 + S1 S3 = L1 − L3 − S1 S1 = S2 − S3 S2 = S1 +S3 S3 = −S1 + S2

In the preferred embodiment, the best price for each market (e.g., L1,L2, . . . S3) is determined and then the quantity available at thatprice is determined. FIG. 8 shows a table of results which were obtainedusing combinations above and some sample market information. The samplemarket information might be received from data feeds from an exchangeand includes:

Market Bid Qty Bid Price Ask Price Ask Qty L1 200 96.86 96.87 200 L2 10096.8 96.81 100 L3 500 94.9 95 300 S1 100 0.05 0.06 100 S2 100 1.8 1.87100 S3 0 0 1.97 100

Looking to L1. The bid prices are preferably determined by substitutingthe appropriate market information into the determined equations. Forexample, L1=L2+S1=96.8+0.05=96.85; L1=L2+S2−S3=96.8+1.8−0=98.6;L1=L3+S1+S3=94.9+0.05+0=94.95; and L1=L3+S2=94.9+1.8=96.7. These pricesare shown in FIG. 9 with respect to implied bid prices for L1. The samecan be done for the implied ask prices for L1. According to thepreferred embodiment, the best bid price, or equivalently, the highestbid price is determined from the implieds as 96.85. The best ask price,or equivalently, the lowest ask price is determine to be 96.71. Thus,market L2 and S1 imply the highest bid price for L1, and market L2, S2,and S3 imply the lowest ask price for L1.

Preferably, the available quantity is determined for the best prices.Looking to L1=L2+S1, it can be shown that L2 has a bid quantity of 100,and S1 has a bid quantity of 100. Taking the minimum of the markets (inthis example they are equal at 100), the available quantity is 100. IfL2 had only 30 available instead of 100 and S1 had 100, then theavailable quantity would only be 30 as only 30 can be supplied at aprice of 96.85. Looking to L1=L2+S2−S3, it can be shown that L2 has anask quantity of 100, S2 has an ask quantity of 100, and S3 has an askquantity of 100. Taking the minimum of the markets (again, in thisexample they are all equal at 100), the available quantity is 100. As aresult for L1, there is a bid quantity of 100 available at an impliedprice of 96.85 and there is an ask quantity of 100 available at animplied price of 96.71. This same process can be repeated for theremaining markets in this example, those remaining include L2, L3, S1,S2, and S3. The results of which are shown in FIG. 8.

Sometimes, there are combinations that provide the same implied price.Then, to determine the quantity available calls for looking at allquantities available from the combinations which result in the sameprice. For example, looking to L2, the best implied ask price is 96.81,in which case, two combinations share the same price result L2=L1−S1 andL2=L3−S1+S2. Preferably, though quantity cannot be used more than once,as has been described above. For example, the first equation is afunction of L1 and S1, both of which imply a minimum quantity of 100.The second equation is a function of L3, S1, and S2. However, becausequantity was “used up” by S1 in the first equation, it is no longeravailable for use in the second equation. Thus, the second equationyields 0 quantity and therefore does not imply any quantity. So, onlyL2=L1−S1 implies 100 at an ask price of 96.81. Another example wherethere is no quantity is shown with respect to the buy side of L3. Thebest price is 96.81, but no quantity is available for S3, so that pricecannot be implied. The next best price is 96.8, but again no quantity isavailable for S3, so that price cannot be implied. The next best priceis 95.06, which implies a quantity of 100.

In the examples directly above, quantity was used up or not available,but sometimes quantities from two or more combinations are added. Forexample, looking to S3, the best implied ask price is 1.81. This isachieved by all combinations. However, S3=L2−L3 implies a quantity of100, whereas S3=−L1+L2+S2 and S3=L1−L3−S1 do not imply any quantitiesbecause they were used up in the first equation. However, S3=−S1+S2implies a quantity of 100. Therefore, the total available quantity is200 at an ask price of 1.81. Alternatively, optimization method, such asa linear method can be used to determine an optimum implied quantity ashas been described above.

Display of Implied Prices and Quantities

As mentioned above, the best implied prices and quantities arepreferably determined. According to the preferred embodiment, thecalculation of implied prices and quantities are computed for everyupdate that occurs in the market. Then, the implied prices arepreferably displayed to the user, such as in the trading applicationdisplay itself, to indicate to a user the implied quantities in themarket. Preferably, the user has the option of turning on or off thedisplay of implied quantities and prices. It is also envisioned that theuser could display only the best prices between direct prices andimplied prices, or show both the direct prices and the implied prices.However, the trading application could be programmed so that the user isnot aware whether the price and quantities are implied or not.

CONCLUSION

Described herein is a system and related methods for computing impliedprices and quantities. First, the system preferably characterizes amarket by exhaustively computing one or more combinations of otherrelated markets such that the markets of each combination when summedwould result in the market under consideration. This step need onlyoccur one time to generate the combinations or equations. Preferably,these combinations or equations are put into a vector notation form. Theequations can be stored in a memory unit or on a disk such as describedabove. Once the equations are solved for, implied prices and quantitiescan be calculated over and over again. It is envisioned that thecomputation of equations and implied prices and quantities can occur onany computing device such as the client device and/or gateway.

Once the equations are determined, each combination can provide impliedmarket information about the market under consideration. The impliedmarket information can be used by the traders in any fashion to betterassist them in trading. As described above, implied prices and theirimplied quantities are useful at trading terminals. Implied prices andquantities are also useful at a host exchange. By having availableinformation that completely characterizes the market (e.g., directorders, implied orders, or both direct and implied orders) at the hostexchange, the matching engine can match orders at improved prices or canadd liquidity to certain tradable objects or strategies.

It should also be understood that the present invention is not limitedto any particular network architecture, but rather may be applied withutility on any electronic device in any network that can be used forelectronic trading. Furthermore, the invention is not limited to acompletely electronic trading environment where orders are sent to anelectronic matching engine. For example, the invention could be utilizedwith an electronic trading application that automatically sends orderselectronically to a terminal where a person (e.g., a floor broker)executes those orders in a traditional open outcry trading floor.

The foregoing description is presented to enable one of ordinary skillin the art to make and use the invention. Various modifications to thepreferred embodiment will be readily apparent to those skilled in theart and the generic principles herein may applied to other embodiments.Therefore, it should be understood that the above description of thepreferred embodiments, alternative embodiments, and specific examplesare given by way of illustration and not limitation. Many changes andmodifications, such as to the methods or system described herein, arewithin the scope of the present invention.

APPENDIX A

Below are some results from running software of the preferred embodimenton 6 related markets, three of which are outright markets and three ofwhich are strategies. The results end with the possible combinationsthat can be used to imply prices and quantities. The combinations wereused in FIG. 8 to imply prices and quantities. Note that as thecombinations are determined, some are accepted and some are rejected.

{ L1 = L1 L2 = L2 L3 = L3 S1 = L1 − L2 S1 = S1 S2 = L1 − L3 S2 = S2 S3 =L2 − L3 S3 = S3 }

Generating . . .

Generated candidate by solving: L1=L1Candidate rejected.Generated candidate by solving: L2=L2Candidate rejected.Generated candidate by solving: L3=L3Candidate rejected.Generated candidate by solving: L1=L2+S1Candidate accepted.Generated candidate by solving: L2=L1−S1Candidate accepted.Generated candidate by solving: S1=S1Candidate rejected.Generated candidate by solving: L1=L3+S2Candidate accepted.Generated candidate by solving: L3=L1−S2Candidate accepted.Generated candidate by solving: S2=S2Candidate rejected.Generated candidate by solving: L2=L3+S3Candidate accepted.Generated candidate by solving: L3=L2−S3Candidate accepted.Generated candidate by solving: S3=S3Candidate rejected.Generated candidate by substituting: L1=L1Candidate rejected.Generated candidate by substituting: L1=L2+S1Candidate rejected.Generated candidate by substituting: L1=L3+S2Candidate rejected.Generated candidate by substituting: L1=L1Candidate rejected.Generated candidate by substituting: L1=L2+S1Candidate rejected.Generated candidate by substituting: L1=L3+S1+S3Candidate accepted.Generated candidate by substituting: L1=L1Candidate rejected.Generated candidate by substituting: L1=L2+S1Candidate rejected.Generated candidate by substituting: L1=L1Candidate rejected.Generated candidate by substituting: L1=L2+S2−S3Candidate accepted.Generated candidate by substituting: L1=L3+S2Candidate rejected.Generated candidate by substituting: L1=L1Candidate rejected.Generated candidate by substituting: L1=L3+S2Candidate rejected.Generated candidate by substituting: L2=L1−S1Candidate rejected.Generated candidate by substituting: L2=L2Candidate rejected.Generated candidate by substituting: L2=L3−S1+S2Candidate accepted.Generated candidate by substituting: L2=L2Candidate rejected.Generated candidate by substituting: L2=L1−S1Candidate rejected.Generated candidate by substituting: L2=L1−S1Candidate rejected.Generated candidate by substituting: L2=L2Candidate rejected.Generated candidate by substituting: L2=L3+S3Candidate rejected.Generated candidate by substituting: L2=L1−S2+S3Candidate accepted.Generated candidate by substituting: L2=L2Candidate rejected.Generated candidate by substituting: L2=L3+S3Candidate rejected.Generated candidate by substituting: L2=L2Candidate rejected.Generated candidate by substituting: L2=L3+S3Candidate rejected.Generated candidate by substituting: L3=L1=S2Candidate rejected.Generated candidate by substituting: L3=L2+S1−S2Candidate accepted.Generated candidate by substituting: L3=L3Candidate rejected.Generated candidate by substituting: L3=L3Candidate rejected.Generated candidate by substituting: L3=L1=S2Candidate rejected.Generated candidate by substituting: L3=L1−S1−S3Candidate accepted.Generated candidate by substituting: L3=L2−S3Candidate rejected.Generated candidate by substituting: L3=L3Candidate rejected.Generated candidate by substituting: L3=L3Candidate rejected.Generated candidate by substituting: L3=L2−S3Candidate rejected.Generated candidate by substituting: L3=L1=S2Candidate rejected.Generated candidate by substituting: L3=L2−S3Candidate rejected.Generated candidate by substituting: L3=L3Candidate rejected.Generated candidate by substituting: S1=L1−L2Candidate rejected.Generated candidate by substituting: S1=S1Candidate rejected.Generated candidate by substituting: S1=−L2+L3+S2Candidate accepted.Generated candidate by substituting: S1=S1Candidate rejected.Generated candidate by substituting: S1=L1−L2Candidate rejected.Generated candidate by substituting: S1=L1−L3−S3Candidate accepted.Generated candidate by substituting: S1=L1−L2Candidate rejected.Generated candidate by substituting: S1=S1Candidate rejected.Generated candidate by substituting: S2=L1−L3Candidate rejected.Generated candidate by substituting: S2=L2−L3+S1Candidate accepted.Generated candidate by substituting: S2=S2Candidate rejected.Generated candidate by substituting: S2=S2Candidate rejected.Generated candidate by substituting: S2=L1−L2+S3Candidate accepted.Generated candidate by substituting: S2=L1−L3Candidate rejected.Generated candidate by substituting: S2=L1−L3Candidate rejected.Generated candidate by substituting: S2=S2Candidate rejected.Generated candidate by substituting: S3=L1−L3−S1Candidate accepted.Generated candidate by substituting: S3=L2−L3Candidate rejected.Generated candidate by substituting: S3=S3Candidate rejected.Generated candidate by substituting: S3=−L1+L2+S2Candidate accepted.Generated candidate by substituting: S3=S3Candidate rejected.Generated candidate by substituting: S3=L2−L3Candidate rejected.Generated candidate by substituting: S3=L2−L3Candidate rejected.Generated candidate by substituting: S3=S3Candidate rejected.Generated candidate by substituting: L1=L1−S1+S2−S3Candidate rejected.Generated candidate by substituting: L1=L2+S2−S3Candidate accepted.Generated candidate by substituting: L1=L3+S2Candidate rejected.Generated candidate by substituting: L1=L1+L2−L3−S3Candidate rejected.Generated candidate by substituting: L1=L2+S2−S3Candidate rejected.Generated candidate by substituting: L1=L3+S2Candidate rejected.Generated candidate by substituting: L1=L2+S2−S3Candidate rejected.Generated candidate by substituting: L1=L1+S1−S2+S3Candidate rejected.Generated candidate by substituting: L1=L2+S1Candidate rejected.Generated candidate by substituting: L1=L3+S1+S3Candidate accepted.Generated candidate by substituting: L1=L1−L2+L3+S3Candidate rejected.Generated candidate by substituting: L1=L3+S1+S3Candidate rejected.Generated candidate by substituting: L1=L2+S1Candidate rejected.Generated candidate by substituting: L1=L3+S1+S3Candidate rejected.Generated candidate by substituting: L2=L1−S2+S3Candidate accepted.Generated candidate by substituting: L2=L2+S1−S2+S3Candidate rejected.Generated candidate by substituting: L2=L3+S3Candidate rejected.Generated candidate by substituting: L2=L3+S3Candidate rejected.Generated candidate by substituting: L2=L1−S2+S3Candidate rejected.Generated candidate by substituting: L2=L1+L2−L3−S2Candidate rejected.Generated candidate by substituting: L2=L1−S2+S3Candidate rejected.Generated candidate by substituting: L2=L1−S1Candidate rejected.Generated candidate by substituting: L2=L2−S1+S2−S3Candidate rejected.Generated candidate by substituting: L2=L3−S1+S2Candidate accepted.Generated candidate by substituting: L2=−L1+L2+L3+S2Candidate rejected.Generated candidate by substituting: L2=L3−S1+S2Candidate rejected.Generated candidate by substituting: L2=L1−S1Candidate rejected.Generated candidate by substituting: L2=L3−S1+S2Candidate rejected.Generated candidate by substituting: L3=L1−S1−S3Candidate accepted.Generated candidate by substituting: L3=L2−S3Candidate rejected.Generated candidate by substituting: L3=L3−S1+S2−S3Candidate rejected.Generated candidate by substituting: L3=L2−S3Candidate rejected.Generated candidate by substituting: L3=L1−S1−S3Candidate rejected.Generated candidate by substituting: L3=L1−L2+L3−S1Candidate rejected.Generated candidate by substituting: L3=L1−S1−S3Candidate rejected.Generated candidate by substituting: L3=L1=S2Candidate rejected.Generated candidate by substituting: L3=L2+S1−S2Candidate accepted.Generated candidate by substituting: L3=L3+S1−S2+S3Candidate rejected.Generated candidate by substituting: L3=L1=S2Candidate rejected.Generated candidate by substituting: L3=L2+S1−S2Candidate rejected.Generated candidate by substituting: L3=−L1+L2+L3+S1Candidate rejected.Generated candidate by substituting: L3=L2+S1−S2Candidate rejected.Generated candidate by substituting: S1=L1−L3−S3Candidate accepted.Generated candidate by substituting: S1=L2−L3+S1−S3Candidate rejected.Generated candidate by substituting: S1=S2−S3Candidate accepted.Generated candidate by substituting: S1=S2−S3Candidate rejected.Generated candidate by substituting: S1=L1−L2Candidate rejected.Generated candidate by substituting: S1=L1−L3−S3Candidate rejected.Generated candidate by substituting: S1=L1−L2Candidate rejected.Generated candidate by substituting: S1=L1−L3−S3Candidate rejected.Generated candidate by substituting: S1=−L1+L3+S1+S2Candidate rejected.Generated candidate by substituting: S1=−L2+L3+S2Candidate accepted.Generated candidate by substituting: S1=S2−S3Candidate rejected.Generated candidate by substituting: S1=L1−L2Candidate rejected.Generated candidate by substituting: S1=S2−S3Candidate rejected.Generated candidate by substituting: S1=−L2+L3+S2Candidate rejected.Generated candidate by substituting: S1=L1−L2Candidate rejected.Generated candidate by substituting: S1=−L2+L3+S2Candidate rejected.Generated candidate by substituting: S2=L1−L2+S3Candidate accepted.Generated candidate by substituting: S2=S1+S3Candidate accepted.Generated candidate by substituting: S2=−L2+L3+S2+S3Candidate rejected.Generated candidate by substituting: S2=S1+S3Candidate rejected.Generated candidate by substituting: S2=L1−L2+S3Candidate rejected.Generated candidate by substituting: S2=L1−L3Candidate rejected.Generated candidate by substituting: S2=L1−L3Candidate rejected.Generated candidate by substituting: S2=L1−L2+S3Candidate rejected.Generated candidate by substituting: S2=L1−L3Candidate rejected.Generated candidate by substituting: S2=L2−L3+S1Candidate accepted.Generated candidate by substituting: S2=S1+S3Candidate rejected.Generated candidate by substituting: S2=−L1+L2+S1+S2Candidate rejected.Generated candidate by substituting: S2=S1+S3Candidate rejected.Generated candidate by substituting: S2=L2−L3+S1Candidate rejected.Generated candidate by substituting: S2=L1−L3Candidate rejected.Generated candidate by substituting: S2=L2−L3+S1Candidate rejected.Generated candidate by substituting: S3=−L1+L2+S2Candidate accepted.Generated candidate by substituting: S3=−S1+S2Candidate accepted.Generated candidate by substituting: S3=L2−L3Candidate rejected.Generated candidate by substituting: S3=−S1+S2Candidate rejected.Generated candidate by substituting: S3=−L1+L2+S2Candidate rejected.Generated candidate by substituting: S3=−L1+L3+S2+S3Candidate rejected.Generated candidate by substituting: S3=L2−L3Candidate rejected.Generated candidate by substituting: S3=−L1+L2+S2Candidate rejected.Generated candidate by substituting: S3=L1−L3−S1Candidate accepted.Generated candidate by substituting: S3=L2−L3Candidate rejected.Generated candidate by substituting: S3=−S1+S2Candidate rejected.Generated candidate by substituting: S3=−S1+S2Candidate rejected.Generated candidate by substituting: S3=L1−L2−S1+S3Candidate rejected.Generated candidate by substituting: S3=L1−L3−S1Candidate rejected.Generated candidate by substituting: S3=L2−L3Candidate rejected.Generated candidate by substituting: S3=L1−L3−S1Candidate rejected.Generated candidate by substituting: L1=L1−S1+S2−S3Candidate rejected.Generated candidate by substituting: L1=L2+S2−S3Candidate rejected.Generated candidate by substituting: L1=L3+S2Candidate rejected.Generated candidate by substituting: L1=L1+L2−L3−S3Candidate rejected.Generated candidate by substituting: L1=L2+S2−S3Candidate rejected.Generated candidate by substituting: L1=L3+S2Candidate rejected.Generated candidate by substituting: L1=L2+S2−S3Candidate rejected.Generated candidate by substituting: L1=L1+S1−S2+S3Candidate rejected.Generated candidate by substituting: L1=L2+S1Candidate rejected.Generated candidate by substituting: L1=L3+S1+S3Candidate rejected.Generated candidate by substituting: L1=L1−L2+L3+S3Candidate rejected.Generated candidate by substituting: L1=L3+S1+S3Candidate rejected.Generated candidate by substituting: L1=L2+S1Candidate rejected.Generated candidate by substituting: L1=L3+S1+S3Candidate rejected.Generated candidate by substituting: L2=L1−S2+S3Candidate rejected.Generated candidate by substituting: L2=L2+S1−S2+S3Candidate rejected.Generated candidate by substituting: L2=L3+S3Candidate rejected.Generated candidate by substituting: L2=L3+S3Candidate rejected.Generated candidate by substituting: L2=L1−S2+S3Candidate rejected.Generated candidate by substituting: L2=L1+L2−L3−S2Candidate rejected.Generated candidate by substituting: L2=L1−S2+S3Candidate rejected.Generated candidate by substituting: L2=L1−S1Candidate rejected.Generated candidate by substituting: L2=L2−S1+S2−S3Candidate rejected.Generated candidate by substituting: L2=L3−S1+S2Candidate rejected.Generated candidate by substituting: L2=−L1+L2+L3+S2Candidate rejected.Generated candidate by substituting: L2=L3−S1+S2Candidate rejected.Generated candidate by substituting: L2=L1−S1Candidate rejected.Generated candidate by substituting: L2=L3−S1+S2Candidate rejected.Generated candidate by substituting: L3=L1−S1−S3Candidate rejected.Generated candidate by substituting: L3=L2−S3Candidate rejected.Generated candidate by substituting: L3=L3−S1+S2−S3Candidate rejected.Generated candidate by substituting: L3=L2−S3Candidate rejected.Generated candidate by substituting: L3=L1−S1−S3Candidate rejected.Generated candidate by substituting: L3=L1−L2+L3−S1Candidate rejected.Generated candidate by substituting: L3=L1−S1−S3Candidate rejected.Generated candidate by substituting: L3=L1=S2Candidate rejected.Generated candidate by substituting: L3=L2+S1−S2Candidate rejected.Generated candidate by substituting: L3=L3+S1−S2+S3Candidate rejected.Generated candidate by substituting: L3=L1=S2Candidate rejected.Generated candidate by substituting: L3=L2+S1−S2Candidate rejected.Generated candidate by substituting: L3=−L1+L2+L3+S1Candidate rejected.Generated candidate by substituting: L3=L2+S1−S2Candidate rejected.Generated candidate by substituting: S1=L1−L3−S3Candidate rejected.Generated candidate by substituting: S1=L2−L3+S1−S3Candidate rejected.Generated candidate by substituting: S1=S2−S3Candidate rejected.Generated candidate by substituting: S1=S2−S3Candidate rejected.Generated candidate by substituting: S1=L1−L2Candidate rejected.Generated candidate by substituting: S1=L1−L3−S3Candidate rejected.Generated candidate by substituting: S1=L1−L2Candidate rejected.Generated candidate by substituting: S1=L1−L3−S3Candidate rejected.Generated candidate by substituting: S1=−L1+L3+S1+S2Candidate rejected.Generated candidate by substituting: S1=−L2+L3+S2Candidate rejected.Generated candidate by substituting: S1=S2−S3Candidate rejected.Generated candidate by substituting: S1=L1−L2Candidate rejected.Generated candidate by substituting: S1=S2−S3Candidate rejected.Generated candidate by substituting: S1=−L2+L3+S2Candidate rejected.Generated candidate by substituting: S1=L1−L2Candidate rejected.Generated candidate by substituting: S1=−L2+L3+S2Candidate rejected.Generated candidate by substituting: S1=L1−L3−S3Candidate rejected.Generated candidate by substituting: S1=S2−S3Candidate rejected.Generated candidate by substituting: S1=−L2+L3+S2Candidate rejected.Generated candidate by substituting: S1=S2−S3Candidate rejected.Generated candidate by substituting: S2=L1−L2+S3Candidate rejected.Generated candidate by substituting: S2=S1+S3Candidate rejected.Generated candidate by substituting: S2=−L2+L3+S2+S3Candidate rejected.Generated candidate by substituting: S2=S1+S3Candidate rejected.Generated candidate by substituting: S2=L1−L2+S3Candidate rejected.Generated candidate by substituting: S2=L1−L3Candidate rejected.Generated candidate by substituting: S2=L1−L3Candidate rejected.Generated candidate by substituting: S2=L1−L2+S3Candidate rejected.Generated candidate by substituting: S2=L1−L3Candidate rejected.Generated candidate by substituting: S2=L2−L3+S1Candidate rejected.Generated candidate by substituting: S2=S1+S3Candidate rejected.Generated candidate by substituting: S2=−L1+L2+S1+S2Candidate rejected.Generated candidate by substituting: S2=S1+S3Candidate rejected.Generated candidate by substituting: S2=L2−L3+S1Candidate rejected.Generated candidate by substituting: S2=L1−L3Candidate rejected.Generated candidate by substituting: S2=L2−L3+S1Candidate rejected.Generated candidate by substituting: S2=L1−L2+S3Candidate rejected.Generated candidate by substituting: S2=S1+S3Candidate rejected.Generated candidate by substituting: S2=L2−L3+S1Candidate rejected.Generated candidate by substituting: S2=S1+S3Candidate rejected.Generated candidate by substituting: S3=−L1+L2+S2Candidate rejected.Generated candidate by substituting: S3=−S1+S2Candidate rejected.Generated candidate by substituting: S3=L2−L3Candidate rejected.Generated candidate by substituting: S3=−S1+S2Candidate rejected.Generated candidate by substituting: S3=−L1+L2+S2Candidate rejected.Generated candidate by substituting: S3=−L1+L3+S2+S3Candidate rejected.Generated candidate by substituting: S3=L2−L3Candidate rejected.Generated candidate by substituting: S3=−L1+L2+S2Candidate rejected.Generated candidate by substituting: S3=L1−L3−S1Candidate rejected.Generated candidate by substituting: S3=L2−L3Candidate rejected.Generated candidate by substituting: S3=−S1+S2Candidate rejected.Generated candidate by substituting: S3=−S1+S2Candidate rejected.Generated candidate by substituting: S3=L1−L2−S1+S3Candidate rejected.Generated candidate by substituting: S3=L1−L3−S1Candidate rejected.Generated candidate by substituting: S3=L2−L3Candidate rejected.Generated candidate by substituting: S3=L1−L3−S1Candidate rejected.Generated candidate by substituting: S3=−L1+L2+S2Candidate rejected.Generated candidate by substituting: S3=−S1+S2Candidate rejected.Generated candidate by substituting: S3=L1−L3−S1Candidate rejected.Generated candidate by substituting: S3=−S1+S2Candidate rejected.Generated candidate by solving: L2=L1=S2+S3Candidate rejected.Generated candidate by solving: S2=L1−L2+S3Candidate rejected.Generated candidate by solving: S3=−L1+L2+S2Candidate rejected.Generated candidate by solving: L3=L1−S1−S3Candidate rejected.Generated candidate by solving: S1=L1−L3−S3Candidate rejected.Generated candidate by solving: S3=L1−L3−S1Candidate rejected.Generated candidate by solving: L1=L2+S2−S3Candidate rejected.Generated candidate by solving: S2=L1−L2+S3Candidate rejected.Generated candidate by solving: S3=−L1+L2+S2Candidate rejected.Generated candidate by solving: L3=L2+S1−S2Candidate rejected.Generated candidate by solving: S1=−L2+L3+S2Candidate rejected.Generated candidate by solving: S2=L2−L3+S1Candidate rejected.Generated candidate by solving: L1=L3+S1+S3Candidate rejected.Generated candidate by solving: S1=L1−L3−S3Candidate rejected.Generated candidate by solving: S3=L1−L3−S1Candidate rejected.Generated candidate by solving: L2=L3−S1+S2Candidate rejected.Generated candidate by solving: S1=−L2+L3+S2Candidate rejected.Generated candidate by solving: S2=L2−L3+S1Candidate rejected.Generated candidate by solving: L1=L3+S1+S3Candidate rejected.Generated candidate by solving: L3=L1−S1−S3Candidate rejected.Generated candidate by solving: S3=L1−L3−S1Candidate rejected.Generated candidate by solving: L2=L3−S1+S2Candidate rejected.Generated candidate by solving: L3=L2+S1−S2Candidate rejected.Generated candidate by solving: S2=L2−L3+S1Candidate rejected.Generated candidate by solving: S2=S1+S3Candidate rejected.Generated candidate by solving: S3=−S1+S2Candidate rejected.Generated candidate by solving: L1=L2+S2−S3Candidate rejected.Generated candidate by solving: L2=L1−S2+S3Candidate rejected.Generated candidate by solving: S3=−L1+L2+S2Candidate rejected.Generated candidate by solving: L2=L3−S1+S2Candidate rejected.Generated candidate by solving: L3=L2+S1−S2Candidate rejected.Generated candidate by solving: S1=−L2+L3+S2Candidate rejected.Generated candidate by solving: S1=S2−S3Candidate rejected.Generated candidate by solving: S3=−S1+S2Candidate rejected.Generated candidate by solving: L1=L2+S2−S3Candidate rejected.Generated candidate by solving: L2=L1−S2+S3Candidate rejected.Generated candidate by solving: S2=L1−L2+S3Candidate rejected.Generated candidate by solving: L1=L3+S1+S3Candidate rejected.Generated candidate by solving: L3=L1−S1−S3Candidate rejected.Generated candidate by solving: S1=L1−L3−S3Candidate rejected.Generated candidate by solving: S1=S2−S3Candidate rejected.Generated candidate by solving: S2=S1+S3Candidate rejected.

Generated Strategies { L1 = L2 + S1 L1 = L2 + S2 − S3 L1 = L3 + S1 + S3L1 = L3 + S2 L2 = L1 − S1 L2 = L1 − S2 + S3 L2 = L3 − S1 + S2 L2 = L3 +S3 L3 = L1 − S1 − S3 L3 = L1 − S2 L3 = L2 + S1 − S2 L3 = L2 − S3 S1 = L1− L3 − S3 S1 = −L2 + L3 + S2 S1 = S2 − S3 S2 = L1 − L2 + S3 S2 = L2 −L3 + S1 S2 = S1 + S3 S3 = −L1 + L2 + S2 S3 = L1 − L3 − S1 S3 = −S1 + S2}

1. A method including: iteratively generating by a computing device aplurality of combination vectors based on at least two vectors of aplurality of available vectors using vector substitution, wherein theplurality of available vectors includes a plurality of identity vectors,one or more definition vectors, and previously generated combinationvectors, wherein each identity vector represents a different tradeableobject of a plurality of tradeable objects, wherein the plurality oftradeable objects includes one or more strategy markets, wherein each ofthe one or more strategy markets includes two or more tradeable objectsof the plurality of tradeable objects, wherein each identity vector isof a dimension equal to a number of tradeable objects in the pluralityof tradeable objects, wherein each definition vector represents one ofthe one or more strategy markets, wherein each definition vector is of adimension equal to the number of tradeable objects in the plurality oftradeable objects, wherein each of the plurality of combination vectorsrepresents an independent market combination for one of the tradeableobjects in the plurality of tradeable objects; determining by thecomputing device implied market information using the plurality ofcombination vectors, wherein the implied market information includesimplied order prices for one or more of the plurality of tradeableobjects; and providing by the computing device the implied marketinformation to a second computing device.
 2. The method of claim 1,wherein the plurality of tradeable objects includes a first tradeableobject and a second tradeable object, wherein the first tradeable objectis at a different exchange than the second tradeable object.
 3. Themethod of claim 1, wherein the one or more strategy markets are spreadmarkets.
 4. The method of claim 1, wherein at least one of the pluralityof tradeable objects is synthetic.
 5. The method of claim 1, whereiniteratively generating the plurality of combination vectors continuesfor a predetermined number of iterations.
 6. The method of claim 1,wherein iteratively generating the plurality of combination vectorscontinues until no new combination vectors are generated.
 7. The methodof claim 1, wherein the implied market information is determined using alinear optimization method.
 8. The method of claim 1, wherein theimplied order prices for the one or more plurality of tradeable objectsinclude inside market prices.
 9. The method of claim 1, wherein thecomputing device includes an electronic exchange.
 10. The method ofclaim 1, wherein the computing device includes a server.
 11. The methodof claim 1, wherein the computing device includes a gateway.
 12. Themethod of claim 1, wherein the computing device includes a clientdevice.
 13. The method of claim 12, wherein the second computing devicealso includes the client device, wherein providing the implied marketinformation includes providing the implied market information from afirst application component to a second application component.
 14. Themethod of claim 1, wherein the second computing device is a clientdevice.
 15. The method of claim 14, wherein the implied marketinformation is displayed by the client device.
 16. The method of claim1, wherein the implied market information includes implied orderquantities corresponding to the implied order prices.
 17. The method ofclaim 1, further including: receiving by the computing device new marketdata related to at least one of the plurality of tradeable objects;determining by the computing device updated implied market informationusing the plurality of combination vectors and the new market data; andproviding by the computing device the updated implied market informationto the second computing device.
 18. The method of claim 1, furtherincluding: receiving by the computing device a notification of a newtradeable object, wherein the new tradeable object is not included inthe plurality of tradeable objects, wherein the new tradeable object isrelated to at least one of the tradeable objects in the plurality oftradeable objects; adding by the computing device the new tradeableobject to the plurality of tradeable objects to create a new pluralityof tradeable objects; and determining by the computing device newimplied market information using a new plurality of combination vectorsgenerated based on the new plurality of tradeable objects.
 19. Themethod of claim 1, further including: receiving by the computing devicea notification that a first tradeable object in the plurality oftradeable objects is no longer available; removing by the computingdevice the first tradeable object from the plurality of tradeableobjects to create a new plurality of tradeable objects; and determiningby the computing device new implied market information using a newplurality of combination vectors generated based on the new plurality oftradeable objects.